Information-theoretic Cryptography

نویسنده

  • Hermann Gruber
چکیده

In 1949, Shannon published the paper ”Communication theory of secrecy systems”. This constituted a foundational treatment and analysis of encryption systems. He transferred the methods of information theory, originally developed as a mathematical model for communication over ”noisy” channels to the setting of cryptosystems. We give a brief introduction into his most outstanding ideas, such as the notions of perfect/provable security, and statistical/information-theoretic concepts like entropy, key equivocation, and unicity distance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the design and security of a lattice-based threshold secret sharing scheme

In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channe...

متن کامل

An Introduction to Differential Computation Analysis (DCA) on the withe-box cryptography algorithms

Advances in information and communication technologies lead to use of some new devices such as smart phones. The new devices provide more advantages for the adversaries hence with respect to them, one can define with-box cryptography. In this new model of cryptography, designers try to hide the key using as a kind of implementation. The Differential Computation Analysis (DCA) is a side channel ...

متن کامل

A Comparison of Two Approaches

The concept of pseudorandomness plays an important role in cryptography. In this note we contrast the notions of complexity-theoretic pseudoran-dom strings (from algorithmic information theory) and pseudorandom strings (from cryptography). For example, we show that we can easily distinguish a complexity-theoretic pseudorandom ensemble from the uniform ensemble. Both notions of pseudorandom stri...

متن کامل

Information-Theoretic Timed-Release Security: Key-Agreement, Encryption, and Authentication Codes

In this paper, we study timed-release cryptography with information-theoretic security. As fundamental cryptographic primitives with information-theoretic security, we can consider keyagreement, encryption, and authentication codes. Therefore, in this paper we deal with informationtheoretic timed-release security for all those primitives. Specifically, we propose models and formalizations of se...

متن کامل

Information-Theoretic Cryptography

We discuss several applications of information theory in cryptography, both for unconditional and for computational security. Unconditionally-secure secrecy, authentication, and key agreement are reviewed. It is argued that unconditional security can practically be achieved by exploiting the fact that cryptography takes place in a physical world in which, for instance due to noise, nobody can h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005